A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
Identifieur interne : 006C57 ( Main/Exploration ); précédent : 006C56; suivant : 006C58A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
Auteurs : Franz Baader ; Silvio Ghilardi ; Cesare Tinelli [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—whose combination is not disjoint since they share the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.
Url:
DOI: 10.1007/978-3-540-25984-8_11
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002950
- to stream Istex, to step Curation: 002914
- to stream Istex, to step Checkpoint: 001867
- to stream Main, to step Merge: 006F62
- to stream Main, to step Curation: 006C57
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics</title><author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name></author><author><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name></author><author><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:AF0AFCF4F3B6FD5466D9D8525D9F86E0E5857031</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-25984-8_11</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-LV7X3VSX-5/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002950</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002950</idno><idno type="wicri:Area/Istex/Curation">002914</idno><idno type="wicri:Area/Istex/Checkpoint">001867</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001867</idno><idno type="wicri:doubleKey">0302-9743:2004:Baader F:a:new:combination</idno><idno type="wicri:Area/Main/Merge">006F62</idno><idno type="wicri:Area/Main/Curation">006C57</idno><idno type="wicri:Area/Main/Exploration">006C57</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics</title><author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name><affiliation><wicri:noCountry code="subField"> </wicri:noCountry></affiliation></author><author><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name><affiliation><wicri:noCountry code="subField"> </wicri:noCountry></affiliation></author><author><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name><affiliation wicri:level="4"><orgName type="university">Université de l'Iowa</orgName><country>États-Unis</country><placeName><settlement type="city">Iowa City</settlement><region type="state">Iowa</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—whose combination is not disjoint since they share the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Iowa</li></region><settlement><li>Iowa City</li></settlement><orgName><li>Université de l'Iowa</li></orgName></list><tree><noCountry><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name></noCountry><country name="États-Unis"><region name="Iowa"><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006C57 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006C57 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:AF0AFCF4F3B6FD5466D9D8525D9F86E0E5857031
|texte= A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
}}
| This area was generated with Dilib version V0.6.33. |  |